Nondifferentiable Optimization with Epsilon Subgradient Methods
نویسنده
چکیده
منابع مشابه
Nondifferentiable Optimization via Approximation*
Optimization problems with nondifferentiable cost functionals, particularly minimax problems, have received considerable attention recently since they arise naturally in a variety of contexts. Optimality conditions for such problems have been derived by several authors while a number of computational methods have been proposed for their solution (the reader is referred to [1] for:a fairly compl...
متن کاملAn improved subgradient method for constrained nondifferentiable optimization
Polyak's subgradient method for constrained nondifferentiable optimization problems is modified in one respect to improve the computational efficiency. The two consecutive projection operations in Polyak method are combined into a single projection operation. The resulting algorithm has a convergence property which is strictly stronger than that of the original Polyak method. A computational te...
متن کاملApproximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
In this paper, we study methods for generating approximate primal solutions as a by-product of subgradient methods applied to the Lagrangian dual of a primal convex (possibly nondifferentiable) constrained optimization problem. Our work is motivated by constrained primal problems with a favorable dual problem structure that leads to efficient implementation of dual subgradient methods, such as ...
متن کاملMultiple Cuts in Separating Plane Algorithms
This paper presents an extended version of the separation plane algorithms for subgradientbased finite-dimensional nondifferentiable convex blackbox optimization. The extension introduces additional cuts for epigraph of the conjugate of objective function which improve the convergence of the algorithm. The case of affine cuts is considered in more details and it is shown that it requires soluti...
متن کاملParallel Subgradient Method for Nonsmooth Convex Optimization with a Simple Constraint
In this paper, we consider the problem of minimizing the sum of nondifferentiable, convex functions over a closed convex set in a real Hilbert space, which is simple in the sense that the projection onto it can be easily calculated. We present a parallel subgradient method for solving it and the two convergence analyses of the method. One analysis shows that the parallel method with a small con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016